Functional Dependencies between Variables

نویسنده

  • Natasha Alechina
چکیده

Itisa standard practice to de ne the truth conditionsfora rst-orderform ula with a quanti erin term sofassignm entsto individualvariables. For exam ple,letM be a m odeland s a function (assignm ent)which assignsto variableselem entsin thedom ain ofM .Then a formula 9x (x)istruein M undersi thereisan assignm entswhich di ersfrom satm ostin thevalue itassignsto x,such that (x)istrue on M unders. However,in classical predicate logic assignm entsare notessential;the sam e truth de nition can be reformulated without m entioning them atall. Forexam ple,we can be slightly sloppy and justsay:9x (x)istruein M ifthereisan elem enta in the dom ain ofM ,such that (a)istrue in M . Thisisso because in classicalpredicate logic variablesare justanonym ousplaceholders;every value

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Relationship between the Verification Based Model and the Functional Dependences Model Using Program Specification

It is generally agreed that faults are very difficult to find, and also expensive to locate and remove from programs. Hence, automating the debugging task is highly desired. This paper presents previous work in automated debugging based on a verification based model, which can detect and localize faults from programs using abstract dependencies. We empirically compare the two models, i.e., Func...

متن کامل

On Classification of Bivariate Distributions Based on Mutual Information

Among all measures of independence between random variables, mutual information is the only one that is based on information theory. Mutual information takes into account of all kinds of dependencies between variables, i.e., both the linear and non-linear dependencies. In this paper we have classified some well-known bivariate distributions into two classes of distributions based on their mutua...

متن کامل

Exploiting functional dependencies in qualitative probabilistic reasoning

Functional dependencies restrict the potential interactions among variables connected in a probabilistic network. This restriction can be exploited in qualitative probabilistic reasoning by introducing deterministic variables and mod­ ifying the inference rules to produce stronger conclusions in the presence of functional rela­ tions. I describe how to accomplish these modi­ fications in qualit...

متن کامل

Design and adjustment of dependency measures

Dependency measures are fundamental for a number of important applications in data mining and machine learning. They are ubiquitously used: for feature selection, for clustering comparisons and validation, as splitting criteria in random forest, and to infer biological networks, to list a few. More generally, there are three important applications of dependency measures: detection, quantificati...

متن کامل

Size Bounds for Conjunctive Queries with General Functional Dependencies

This paper extends the work of Gottlob, Lee, and Valiant (PODS 2009) [9], and considers worst-case bounds for the size of the result Q(D) of a conjunctive query Q to a database D given an arbitrary set of functional dependencies. The bounds in [9] are based on a “coloring” of the query variables. In order to extend the previous bounds to the setting of arbitrary functional dependencies, we leve...

متن کامل

Computing Similarity Dependencies with Pattern Structures

Functional dependencies provide valuable knowledge on the relations between the attributes of a data table. To extend their use, generalizations have been proposed, among which purity and approximate dependencies. After discussing those generalizations, we provide an alternative definition, the similarity dependencies, to handle a similarity relation between data-values, hence un-crisping the b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Studia Logica

دوره 66  شماره 

صفحات  -

تاریخ انتشار 2000